A Presheaf Semantics of Value-Passing Processes
نویسندگان
چکیده
منابع مشابه
A Presheaf Semantics of Value-Passing Processes
This paper investigates presheaf models for process calculi with value passing. Denotational semantics in presheaf models are shown to correspond to operational semantics in that bisimulation obtained from open maps is proved to coincide with bisimulation as defined traditionally from the operational semantics. Both “early” and “late” semantics are considered, though the more interesting “late”...
متن کاملOn the Semantics of Message Passing Processes
Let J be a shape in some category Shp for which there is a functor : Shp Cat. A categorical transition system (or system) is a pair (J; (J) C) consisting of a shape labelled by a functor in a category in C. Systems generalize conventional labelled transition systems. By choosing a suitable universe of shapes, systems can model concurrent and asynchronous computation. By labelling in a category,...
متن کاملSemantics of Name and Value Passing
We provide a semantic framework for (first order) message-passing process calculi by combining categorical theories of abstract syntax with binding and operational semantics. In particular, we obtain abstract rule formats for name and value passing with both late and early interpretations. These formats induce an initial-algebra/finalcoalgebra semantics that is compositional, respects substitut...
متن کاملModel Checking Value-Passing Processes
An algorithm for model checking value-passing processes is presented. Processes are modeled as symbolic transition graphs with assignments. To specify properties for such processes a graphical predicate mu-calculus is introduced. It allows arbitrary nesting of the least and greatest fixpoints, and contains the propositional mu-calculus as a proper subset. The algorithm instantiates input variab...
متن کاملA Verification Tool for Value-Passing Processes
A proof system is described which is capable of handling processes with value-passing. It implements inference systems that treats data and boolean expressions symbolically. Users are allowed to deene the syntax and axioms for their own calculi. Proofs are performed by either invoking proof rules or applying equational axioms as rewrite rules. Help facilities are provided to make it easier to c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1996
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v3i44.20046